Evaluation-Function Based Proof-Number Search
نویسندگان
چکیده
This article introduces Evaluation-Function based Proof– Number Search (EF-PN) and its second-level variant EF-PN. It is a framework for setting the proof and disproof number of a leaf node with a heuristic evaluation function. Experiments in LOA and Surakarta show that compared to PN and PN, which use mobility to initialize the proof and disproof numbers, EF-PN and EF-PN take between 45% to 85% less time for solving positions. Based on these results, we may conclude that EF-PN and EF-PN reduce the search space considerably.
منابع مشابه
A An Evaluation-Driven Decision Procedure for G3i
It is well-known that G3i, the sequent calculus for intuitionistic propositional logic where weakening and contraction are absorbed into the rules, is not terminating. Indeed, due to the contraction in the rule for left implication, the naı̈ve goal-oriented proof-search strategy, consisting in applying the rules of the calculus bottom-up until possible, can generate branches of infinite length. ...
متن کاملMonte-Carlo Proof-Number Search for Computer Go
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It requires a well defined goal to prove. This can be seen as a disadvantage. In contrast to proof-number search, Monte-Carlo evaluation is a flexible stochastic evaluation for game-tree search. In order to improve the eff...
متن کاملEfficient Search for Transformation-based Inference
This paper addresses the search problem in textual inference, where systems need to infer one piece of text from another. A prominent approach to this task is attempts to transform one text into the other through a sequence of inference-preserving transformations, a.k.a. a proof, while estimating the proof’s validity. This raises a search challenge of finding the best possible proof. We explore...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملAn Alternative Stability Proof for Direct Adaptive Function Approximation Techniques Based Control of Robot Manipulators
This short note points out an improvement on the robust stability analysis for electrically driven robots given in the paper. In the paper, the author presents a FAT-based direct adaptive control scheme for electrically driven robots in presence of nonlinearities associated with actuator input constraints. However, he offers not suitable stability analysis for the closed-loop system. In other w...
متن کامل